Load balancing by graph coloring, an algorithm
نویسندگان
چکیده
منابع مشابه
A practical algorithm for [r, s, t]-coloring of graph
Coloring graphs is one of important and frequently used topics in diverse sciences. In the majority of the articles, it is intended to find a proper bound for vertex coloring, edge coloring or total coloring in the graph. Although it is important to find a proper algorithm for graph coloring, it is hard and time-consuming too. In this paper, a new algorithm for vertex coloring, edge coloring an...
متن کاملAn Optimal Dynamic Load Balancing Algorithm
The problem of redistributing work load on parallel computers is considered. An optimal redistribution algorithm, which minimises the Euclidean norm of the migrating load, is derived. The problem is further studied by modelling with the unsteady heat conduction equation. Relationship between this algorithm and other dynamic load balancing algorithms is discussed. Convergence of the algorithm fo...
متن کاملAn Improved Hadoop Data Load Balancing Algorithm
Data load balancing is one of the key problems of big data technology. As a big data application, Hadoop has had many successful applications. HDFS is Hadoop Distributed File System and has the load balancing procedure which can balance the storage load on each machine. However, this method cannot balance the overload rack preferentially, and so it is likely to cause the breakdown of overload m...
متن کاملAn Adaptive, Load Balancing Parallel Join Algorithm
Vineet Singh Many parallel join algorithms have been proposed in the last several years. However, most of these algorithms require that the amount of data to be joined is known in advance in order to choose the proper number of join processors. This is an unrealistic assumption because data sizes are typically unknown, and are notoriously hard to estimate. We present an adaptive, load-balancing...
متن کاملAn efficient dynamic load balancing algorithm
In engineering problems, randomness and uncertainties are inherent. Robust design procedures, formulated in the framework of multi-objective optimization, have been proposed in order to take into account sources of randomness and uncertainty. These design procedures require orders of magnitude more computational effort than conventional analysis or optimum design processes since a very large nu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 1994
ISSN: 0898-1221
DOI: 10.1016/0898-1221(94)90043-4